Parallel Algorithms for Detecting Strongly Connected Components
نویسنده
چکیده
منابع مشابه
Technical Report: On Fast Parallel Detection of Strongly Connected Components (SCC) in Small-World Graphs
Detecting strongly connected components (SCCs) in a directed graph is a fundamental graph analysis algorithm that is used in many science and engineering domains. Traditional approaches in parallel SCC detection, however, show limited performance and poor scaling behavior when applied to large real-world graph instances. In this paper, we investigate the shortcomings of the conventional approac...
متن کاملDetecting Strongly Connected Components in Large Distributed State Spaces Sen Software Engineering Detecting Strongly Connected Components in Large Distributed State Spaces
Detecting cycles in a state space is a key task in verification algortihms like LTL/CTL model checking and, less well known, reduction modulo branching bisimulation. This paper focuses on the problem of finding cycles (strongly connected components) in very large distributed state spaces. We present a collection of state space transformations meant as building blocks for custom algorithms. We a...
متن کاملEfficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
This article presents parallel algorithms for component decomposition of graph structures on general purpose graphics processing units (GPUs). In particular, we consider the problem of decomposing sparse graphs into strongly connected components, and decomposing graphs induced by stochastic games (such as Markov decision processes) into maximal end components. These problems are key ingredients...
متن کاملGPU-Based Graph Decomposition into Strongly Connected and Maximal End Components
This paper presents parallel algorithms for component decomposition of graph structures on General Purpose Graphics Processing Units (GPUs). In particular, we consider the problem of decomposing sparse graphs into strongly connected components, and decomposing stochastic games (such as Markov decision processes) into maximal end components. These problems are key ingredients of many (probabilis...
متن کاملOn the parallel computation of the biconnected and strongly connected co-components of graphs
In this paper, we consider the problems of co-biconnectivity and strong co-connectivity, i.e., computing the biconnected components and the strongly connected components of the complement of a given graph. We describe simple sequential algorithms for these problems, which work on the input graph and not on its complement, and which for a graph on n vertices and m edges both run in optimal O(n +...
متن کامل